Complexity and its Application to Lower Bounds on Branching Program

Coding-Theoretic Lower Bounds for Boolean Branching Programs

We develop a general method for proving lower bounds on the complexity of branching programs. The proposed proof technique is based on a connection between branching programs and error-correcting codes and makes use of certain classical results in coding theory. Specifically, lower bounds on the complexity of branching programs computing certain important functions follow directly from lower bo...

Superlinear Lower Bounds for Bounded-Width Branching Programs

We use algebraic techniques to obtain superlinear lower bounds on the size of bounded-width branching programs to solve a number of problems. In particular, we show that any bounded-width branching program computing a nonconstant threshold function has length (n log log n); improving on the previous lower bounds known to apply to all such threshold functions. We also show that any program over ...

Complexity to get Lower Bounds on Branching Program

Expanders and time-restricted branching programs

The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variables re-tested along different computations may be different. For every branching program, this number lies between 0 (read-once programs) and the total number n of variables (general branching programs). The best resul...

Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits

Each (nondeterministic) multilective VLSI-circuit C of area A can be simulated by an oblivious (disjunctive) branching program of width exp(O(A)) which has the same multiplicity of reading as C. That is why exponential lower bounds on the width of (disjunctive) oblivious branching programs of linear depth provide lower bounds of order Sl(nlm2’), 0 <a < i, on the area of (nondeterministic) multi...